منابع مشابه
Low-complexity transform coding with integer-to-integer transforms
In this paper we propose the application of a new transform-based coding method[1] in conjunction with Golomb-Rice ( ) codes to lower significantly the complexity, which can be used in various applications, e.g. the Multiple Description coding[2]. The theoretical evaluations predict no important loss in compression performance, while the complexity is considerably reduced. Since codes are very ...
متن کاملThe Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a search procedure (”branch and prune”) and used at every node of the search tree to narrow down the search space, so it is critical that it be fast. The procedure invokes constraint propagators until a common fixpoint is re...
متن کاملOn the Complexity of Integer Factorization
This note presents a deterministic integer factorization algorithm based on a system of polynomials equations. This technique exploits a new idea in the construction of irreducible polynomials with parametized roots, and recent advances in polynomial lattices reduction methods. The main result establishes a new deterministic time complexity bench mark. 1 Introduction This note presents a determ...
متن کاملThe complexity of Euler's integer partition theorem
Euler’s integer partition theorem stating that the number of partitions of an integer into odd integers is equal to the number of partitions into distinct integers ranks 16 in Wells’ list of the most beautiful theorems [17]. In this paper we use the algorithmic method to evaluate the complexity of mathematical statements developed in [3, 4, 5] to show that Euler’s theorem is in class CU,7, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Moscow Journal of Combinatorics and Number Theory
سال: 2019
ISSN: 2640-7361,2220-5438
DOI: 10.2140/moscow.2019.8.193